Size and area of square lattice polygons
نویسنده
چکیده
We use the finite lattice method to calculate the radius of gyration, the first and second area-weighted moments of self-avoiding polygons on the square lattice. The series have been calculated for polygons up to perimeter 82. Analysis of the series yields high accuracy estimates confirming theoretical predictions for the value of the size exponent, ν = 3/4, and certain universal amplitude combinations. Furthermore, a detailed analysis of the asymptotic form of the series coefficients provide the firmest evidence to date for the existence of a correction-to-scaling exponent, ∆ = 3/2.
منابع مشابه
0 Statistics of lattice animals ( polyominoes ) and polygons
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, τ = 4.062570(8), for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound τ >...
متن کاملStatistics of lattice animals (polyominoes) and polygons
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, τ = 4.062 570(8), for the growth constant of lattice animals and confirms, to a very high degree of certainty, that the generating function has a logarithmic divergence. We prove the bound ...
متن کاملPunctured polygons and polyominoes on the square lattice
We use the finite lattice method to count the number of punctured staircase and selfavoiding polygons with up to three holes on the square lattice. New or radically extended series have been derived for both the perimeter and area generating functions. We show that the critical point is unchanged by a finite number of punctures, and that the critical exponent increases by a fixed amount for eac...
متن کاملOsculating and neighbour-avoiding polygons on the square lattice*
We study two simple modifications of self-avoiding polygons (SAPs). Osculating polygons (OP) are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons (NAP) are only allowed to have nearest-neighbour vertices provided these are joined by the associated edge and thus form a sub-set of SAPs. We use the finite lattice method to count the numbe...
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کامل